Solving Min-Max Capacitated Vehicle Routing Problem by Local Search
نویسندگان
چکیده
منابع مشابه
Solving Min-Max Vehicle Routing Problem
The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply improved insertion method so as to improve the feasibility of the solution; retain the best selection so as to guard the diversity of...
متن کاملSolving Min-Max Multi-Depot Vehicle Routing Problem∗
The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots of origin at the end of their assigned tours. The traditional objective in MDVRP is to minimize the sum of all tour lengths, and existing literature handles this problem with a variety of assumptions and...
متن کاملMin-max Vehicle Routing Problem Based on Ant Colony Algorithm
To minimize the length of travelling distance of the longest sub-route in vehicle routing problem, the max-min ant system with parameter adaptation is adopted, which can be applied to different datasets in practice. Routes are constructed by sequential and parallel methods for the customers with clustering and random distribution respectively. Since the behavior of ant colony algorithm depends ...
متن کاملSolution of a Min-Max Vehicle Routing Problem
We use a branch-and-cut search to solve the Whizzkids’96 vehicle routing problem, demonstrating that the winning solution in the 1996 competition is in fact optimal. Our algorithmic framework combines the LP-based traveling salesman code of Applegate, Bixby, Chvátal, and Cook, with specialized cutting planes and a distributed search algorithm, permitting the use of a computing network located a...
متن کاملAn ant colony optimization technique for solving min-max Multi-Depot Vehicle Routing Problem
The Multi-Depot Vehicle Routing Problem (MDVRP) involves minimizing the total distance traveled by vehicles originating from multiple depots so that the vehicles together visit the specified customer locations (or cities) exactly once. This problem belongs to a class of Nondeterministic Polynomial Hard (NP Hard) problems and has been used in literature as a benchmark for development of optimiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2017
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/33/1/8846